Identifying an automaton model for timed data
نویسندگان
چکیده
A model for discrete event systems (DES) can be learned from observations. We propose a simple type of timed automaton to model DES where the timing of the events is important. Learning such an automaton is proven to be NP-complete by a reduction from the problem of learning deterministic finite state automata (DFA) without time. Based on this reduction, we show how the currently best learning algorithm for DFAs (state merging) can be adapted to deal with time information.
منابع مشابه
A Likelihood-Ratio Test for Identifying Probabilistic Deterministic Real-Time Automata from Positive Data
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to the setting of positive timed strings (or time-stamped event sequences). An DRTA can be seen as a deterministic finite state automaton (DFA) with time constraints. Because DRTAs model time using numbers, they can be exponentially more compact than equivalent DFA models that model time using stat...
متن کاملThe efficiency of identifying timed automata and the power of clocks
We develop theory on the efficiency of identifying (learning) timed automata. In particular, we show that: i) deterministic timed automata cannot be identified efficiently in the limit from labeled data, and ii) that one-clock deterministic timed automata can be identified efficiently in the limit from labeled data. We prove these results based on the distinguishability of these classes of time...
متن کاملA likelihood-ratio test for identifying probabilistic deterministic real-time automata from positive data1
Timed automata (TAs) are finite state models that represent timed events using an explicit notion of time, i.e., using numbers. They can be used to model and reason about real-time systems. In these system, each occurrence of a symbol (event) is associated with a time value, i.e., its time of occurrence. TAs can be used to accept or generate a sequence (a1, t1)(a2, t2)(a3, t3) . . . (an, tn) of...
متن کاملPolynomial Distinguishability of Timed Automata
We study the complexity of identifying (learning) timed automata in the limit from data. Timed automata are finite state models that model time explicitly, i.e., using numbers. Because timed automata use numbers to represent time, they can be exponentially more compact than models that model time implicitly, i.e., using states. We show three results that are essential in order to exactly determ...
متن کاملTimed Automata for Behavioral Pattern Recognition
Real-world systems can often be modelled by systems consisting of states and transitions between these states, triggered by certain events. These systems are called discrete event systems [4]. We are interested in the creation of such an event system for the detection of different types of behavior within a real-world system. The detection takes place using time series data from different kinds...
متن کامل